1
کامپیوتر و شبکه::
درخت متراکم مرکل
The state is a sparse Merkle tree with an ( 7 ) account blob at each leaf.
Figure 5: Three versions of a sparse Merkle tree storing D = {01002 : A, 10002 : B, 10112 : C}.
While a tree of size 2256 is an intractable representation, optimizations can be applied to form a sparse Merkle tree.
When the sparse Merkle tree is updated after the execution of a transaction, the new tree reuses unchanged portions of the previous version, forming a persistent data structure [28, 29].
We considered AVL-based trees, which provide more optimal worst-case proof length than sparse Merkle trees [30].
واژگان شبکه مترجمین ایران